IP Library Granted Patent US 10,180,936
Granted Patent B2
US 10,180,936 · App. 15/470,846 · Granted Jan 15, 2019

Human readable mechanism for communicating binary data

Inventors: Jon Arron McClintock (Seattle, WA); Darren Ernest Canavor (Redmond, WA); Jesper Mikael Johansson (Redmond, WA)
Assignee: Amazon Technologies, Inc.
G06F17/2765G06F3/0481G06F17/2276G06F17/271G06F17/2735G06F17/2755G06F17/2881G06F17/30386G06F17/28
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,180,936
App. No.
15/470,846
Granted
Jan 15, 2019
Kind
B2
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.

Claims (36)

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;

determining a set of morphemes included in a symbol of the plurality of symbols;

generating a bit value for the plurality of symbols based at least in part on a symbol map that associates bit values with respective morphemes, where the symbol map further indicates that a particular sequence of bits corresponds to a particular symbol based at least in part on a particular set of morphemes included in the particular symbol by at least determining a sequence of bits that includes a subsequence of bits associated with the set of morphemes; 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 implementing one or more services, wherein the one or more services:

obtain a set of symbols, at least one symbol of the set of symbols including at least two morphemes;

determine a sequence of bit values that includes a bit sequence associated with a symbol selected from the set of symbols by at least

determining, based at least in part on information that associates bit values with respective morphemes, the bit sequence associated with the symbol, the information including an indication that a particular bit sequence corresponds to a particular symbol based at least in part on a particular set of morphemes included in the particular symbol;

identify a value associated with the set of symbols, based at least in part on the sequence of bit values; and

provide the value.

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 symbol 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 symbol further comprises including a preposition in the symbol, where the preposition modifies a particular bit sequence associated with the 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, upon execution by one or more processors of a computer system, cause the computer system to at least:

obtain a set of symbols included in a request to determine a value associated with the set of symbols;

determine a sequence of bits associated with the set of symbols by at least:

determining a set of morphemes included in a 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, wherein the information 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; 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 set of morphemes further includes at least one noun.

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

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

17. The non-transitory computer-readable storage medium of claim 13 , wherein the instructions further comprise instructions that, upon execution 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.

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

19. 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, upon execution 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.

20. The non-transitory computer-readable storage medium of claim 13 , wherein the computer system may obtain a set of morphemes based at least in part on region settings of the computer system.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 27, 2017
From: MCCLINTOCK, JON ARRON; CANAVOR, DARREN ERNEST; JOHANSSON, JESPER MIKAEL
To: AMAZON TECHNOLOGIES, INC.
Reel/Frame 041757/0189 →
Continuity (2)
Continuation 14470886 · Aug 27, 2014
Related Publication 20170199868A1 · Jul 13, 2017
Cited By (2)
US 12,254,870 US 12,456,002