US2022343069A1PendingUtilityA1

Method of converting between an n-tuple and a document using a readable text and a text grammar

Assignee: VYSE JONATHAN MARKPriority: Apr 24, 2021Filed: Apr 24, 2021Published: Oct 27, 2022
Est. expiryApr 24, 2041(~14.7 yrs left)· nominal 20-yr term from priority
G06F 40/151G06F 40/226G06F 40/166G06F 40/232
17
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Embodiments are directed at processing language content by a method of bi-directional conversion between language content with additional information to and from documents, using a readable text and a text grammar. A method combines additional information with the language content using punctuation idioms. The combined language content and additional information remains readable by one ordinarily skilled in the art of reading and also remains allowable according to a text grammar; that is embodiments are rigorous and may be declarative. The document is compliant with a format drawn from a set which comprises SGML, XML, TEI, HTML, DOC, DOCX, ODX, PDF and XPS. The document is publishable in a medium drawn from a set which comprises a book, a magazine, a journal, a newspaper, an article and a web page. A computer-readable memory device and a computing device are also claimed.

Claims

exact text as granted — not AI-modified
The invention claimed is as follows: 
     
         1 ) A converting method [A]; the method comprising:
 (i) converting, using a readable text [I] and a text grammar [J], between an n-tuple [K] and a document [L]; wherein the n-tuple [K] comprises some language content [M] and some additional information [N].   
     
     
         2 ) The method of  claim 1  further comprising:
 (i) an orthographic method [D]; the method comprising:
 (a) converting between the n-tuple [K] and some pointed annotated written language [O] using the text grammar [J]. 
 
 
     
     
         3 ) The method of  claim 2  further comprising:
 (i) a text creation method [E]; the method comprising:
 (a) converting between some pointed annotated written language [O] and the readable text [I] using the text grammar [J] and a marking method [F]. 
 
 
     
     
         4 ) The method of  claim 3  further comprising:
 (i) a text encapsulation method [G]; the method comprising:
 (a) converting between the readable text [I] and an encapsulated text [P] using the text grammar [I]; wherein the encapsulated text [P] comprises: a verification result [Q] and a post-verification text [R]. 
 
 
     
     
         5 ) The method of  claim 4  further comprising:
 (i) a text conversion method [H]; the method comprising:
 (a) converting between the post-verification text [R] element of the encapsulated text [P] and the document [L]. 
 
 
     
     
         6 ) The readable text [I], obtained by the method of  claim 1 ; wherein the readable text [I] is an allowable text [W]. 
     
     
         7 ) The readable text [I], obtained by the method of  claim 1 ; wherein the readable text [I] comprises: a rigorous set of punctuation idioms [AG]. 
     
     
         8 ) The document [L], obtained by the method of  claim 1 ; wherein the readable text [I] is an allowable text [W]. 
     
     
         9 ) The method of  claim 1 ; wherein the document [L] is compliant with a format [S]; wherein the format [S] is drawn from a set of formats [T]; wherein the set of formats [T] comprises: SGML, XML, TEI, HTML, DOC, DOCX, ODX, PDF and XPS. 
     
     
         10 ) The method of  claim 1 ; wherein the document [L] is publishable using a medium [U]; wherein the medium [U] is drawn from a set of mediums [V]; wherein the set of mediums [V] comprises: a book, a magazine, a journal, a newspaper, an article, and a web page. 
     
     
         11 ) The method of  claim 1 ; wherein the readable text [I] consists of: a multiset of characters [X] drawn from a limited set of characters [Y]. 
     
     
         12 ) The method of  claim 1 ; wherein the text grammar [J] is one or more of: a context free grammar [Z]; or comprising: a lex description [AA], and a YACC grammar [AB]. 
     
     
         13 ) The method of  claim 1 , wherein the text grammar [J] comprises: a set of text grammar rules [AC]; wherein the set of text grammar rules [AC] further comprises: a multiset of terminal and non-terminal symbols [AD]; wherein one or more of the multiset of terminal and non-terminal symbols [AD] is an encoded terminal or non-terminal symbol [AE]; wherein the encoded terminal or non-terminal symbol [AE] is drawn from a set of text grammars [AF]; wherein the set of text grammars [AF] comprises: SGML, XML, TEI, HTML, DOCX, ODX and XPS. 
     
     
         14 ) the method of  claim 1 , wherein the text grammar [J] is configured with a set of text grammar rules [AC] comprising: a rigorous set of punctuation idioms [AG]. 
     
     
         15 ) the method of  claim 3 , wherein the readable text [I] is an allowable text [W]. 
     
     
         16 ) A computer-readable memory device [B] with a multiset of instructions [AH], which is a not empty multiset, stored thereon; the multiset of instructions [AH] comprising:
 (i) the performance of the method of converting, using a readable text [I] and a text grammar [J], between an n-tuple [K] and a document [L]; wherein the document [L] is compliant with a format [S]; wherein the format [S] is drawn from a set of formats [T]; wherein the set of formats [T] comprises: SGML, XML, TEI, HTML, DOC, DOCX, ODX, PDF and XPS.   
     
     
         17 ) The computer-readable memory device [B] of  claim 16 , wherein the text grammar [J] is one or more of: a context free grammar [Z]; or comprising: a lex description [AA], and a YACC grammar [AB]. 
     
     
         18 ) The computer-readable memory device [B] of  claim 16 , wherein the text grammar [J] comprises: a set of text grammar rules [AC]; wherein the set of text grammar rules [AC] further comprises: a multiset of terminal and non-terminal symbols [AD]; wherein one or more of the multiset of terminal and non-terminal symbols [AD] is an encoded terminal or non-terminal symbol [AE]; wherein the encoded terminal or non-terminal symbol [AE] is drawn from a set of text grammars [AF]; wherein the set of text grammars [AF] comprises: SGML, XML, TEI, HTML, DOCX, ODX and XPS. 
     
     
         19 ) The computer-readable memory device [B] of  claim 16 , wherein the text grammar [J] is configured with a set of text grammar rules [AC] comprising: a rigorous set of punctuation idioms [AG]. 
     
     
         20 ) A computing device [C]: the computing device [C] comprising:
 (i) the computer-readable memory device [B] with a multiset of instructions [AH], which is a not empty multiset, stored thereon of  claim 16 ; and   (ii) a processor [AI] coupled to the computer-readable memory device [B] with the multiset of instructions [AH] stored thereon of  claim 16 , the processor [AI] executing a reader application [AJ] with the multiset of instructions [AH] stored with the computer-readable memory device [B] with the multiset of instructions [AH] stored thereon of  claim 16 , wherein the reader application [AJ] is configured to perform the method of:
 (a) converting, using a readable text [I] and a text grammar [J], between an n-tuple [K] and a document [L]; wherein the document [L] is compliant with a format [S] drawn from a set of formats [T]; wherein the set of formats [T] comprises: SGML, XML, TEI, HTML, DOC, DOCX, ODX, PDF and XPS.

Join the waitlist — get patent alerts

Track US2022343069A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.