Human readable mechanism for communicating binary data

Patent metadata

Field	Value
Publication number	US-2017199868-A1
Application number	US-201715470846-A
Country	US
Kind code	A1
Filing date	Mar 27, 2017
Priority date	Aug 27, 2014
Publication date	Jul 13, 2017
Grant date	—

Abstract

A mechanism is provided for representing information, such as binary sequence, in a manner that is easier to read and less likely to generate errors when interacted with by human. A dictionary is seeded with two or more set of words, the words being selected from distinct categories. Symbols may be created by combining words from the distinct categories. A mapping of symbols to corresponding values may then be generated. The generated mapping may be used to translate bit values to symbols and symbols to bit values.

First claim

What is claimed is:

1 . A computer-implemented method, comprising:
obtaining a plurality of symbols, at least one symbol of the plurality of symbols including at least one morpheme; generating a bit value for the plurality of symbols based at least in part on a symbol map, where the symbol map indicates a particular sequence of bits corresponding to a particular symbol based at least in part on a set of morphemes included in the particular symbol; and providing the bit value.

2 . The computer-implemented method of claim 1 , wherein a first symbol of the plurality of symbols further comprises at least two items from a group consisting of an adjective, a noun, and a verb.

3 . The computer-implemented method of claim 2 , wherein the first symbol of the plurality of symbols further comprises a preposition.

4 . The computer-implemented method of claim 3 , wherein a second symbol of the plurality of symbols further comprises an adjective and a noun.

5 . A system, comprising:
at least one computing device configured to implement one or more services, wherein the one or more services:
receive a set of symbols, at least one symbol of the set of symbols including at least two morphemes;
determine a sequence of bit values by at least:
selecting a first symbol from the set of symbols;
determining, based at least in part on information that associates bit values with respective morphemes, a bit sequence associated with the first symbol; and

identify value based at least in part on the sequence of bit values.

6 . The system of claim 5 , wherein a first morpheme of the at least two morphemes is selected from a first dictionary and a second morpheme of the at least two morphemes is selected from a second dictionary.

7 . The system of claim 6 , wherein the first dictionary is seeded with a set of verbs such that no verb of the set of verbs is a homonym or homophone of another verb of the set of verbs.

8 . The system of claim 6 , wherein the second dictionary is seeded with a set of nouns such that no noun of the set of nouns is a homograph or heteronym of another noun of the set of nouns.

9 . The system of claim 5 , wherein at least one symbol of the set of symbols includes three morphemes.

10 . The system of claim 5 , wherein the one or more services further comprises a dictionary service, wherein the dictionary service generates a dictionary by at least seeding a first dictionary with a first set of morphemes and a second dictionary with a second set of morphemes.

11 . The system of claim 10 , wherein the one or more services further include generating the first symbol of the set of symbols by at least selecting a first morpheme from the first dictionary and a second morpheme from the second dictionary.

12 . The system of claim 11 , wherein generating the first symbol further comprises including a preposition in the first symbol, where the preposition modifies a particular bit sequence associated with the first symbol based at least in part on the information that associates bit values with respective morphemes.

13 . A non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by one or more processors of a computer system, cause the computer system to at least:
receive a set of symbols included in a request to determine a value associated with the set of symbols; determine a sequences of bits associated with the set of symbols by at least:
determining a set of morphemes included in a first symbol of the set of symbols;
determining a subsequence of bits associated with the set of morphemes based at least in part on information that associates bit values with respective morphemes; and
including the subsequence of bits in the sequence of bits; and
provide the value associated with the set of symbols based at least in part on the sequence of bits.

14 . The non-transitory computer-readable storage medium of claim 13 , wherein the information that associates bit values with respective morphemes further includes an indication that a particular subsequence of bits corresponds to a particular symbol based at least in part on a particular set of morphemes included in the particular symbol.

15 . The non-transitory computer-readable storage medium of claim 13 , wherein the set of morphemes further includes at least one noun.

16 . The non-transitory computer-readable storage medium of claim 15 , wherein the set of morphemes further includes at least one adjective.

17 . The non-transitory computer-readable storage medium of claim 16 , wherein the set of morphemes further includes at least one verb.

18 . The non-transitory computer-readable storage medium of claim 13 , wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to perform a comparison of the value associated with the set of symbols with an expected value.

19 . The non-transitory computer-readable storage medium of claim 18 , wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to provide access to a computing resources as a result of the comparison.

20 . The non-transitory computer-readable storage medium of claim 13 , wherein the instructions that cause the computer system to provide the value associated with the set of symbols further comprise instructions that, when executed by the one or more processors, cause the computer system to transmit the value associated with the set of symbols to an authentication service of a computing resource service provider.

Assignees

• Amazon Tech Inc

Inventors

• Mcclintock Jon Arron
• Canavor Darren Ernest
• Johansson Jesper Mikael

Classifications

• G06F40/40

  Processing or translation of natural language (natural language analysis G06F40/20; semantic analysis G06F40/30) · CPC title

• G06F40/157

  using dictionaries or tables · CPC title

• G06F16/24

  Querying · CPC title

• G06F40/211

  Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars · CPC title

• G06F40/279 Primary

  Recognition of textual entities · CPC title