Method for mathematical language processing via tree embeddings
| dc.contributor.assignee | Rice University | en_US |
| dc.contributor.assignee | University of Massachusetts | en_US |
| dc.contributor.publisher | United States Patent and Trademark Office | en_US |
| dc.creator | Wang, Zichao | en_US |
| dc.creator | Lan, Shiting | en_US |
| dc.creator | Baraniuk, Richard G. | en_US |
| dc.date.accessioned | 2024-12-09T17:26:04Z | en_US |
| dc.date.available | 2024-12-09T17:26:04Z | en_US |
| dc.date.filed | 2023-04-21 | en_US |
| dc.date.issued | 2024-11-19 | en_US |
| dc.description.abstract | A method for processing formulae includes encoding a formula by: training, with a server, a model by using a machine learning algorithm with a data set that includes a plurality of formulae; transforming, with a processor, a first formula into a tree format using the trained model; converting, with the processor, the tree format of the first formula into a plurality of lists; and encoding, with the processor, the plurality of lists into a fixed dimension vector by leveraging a stacked attention module; and generating one or more formula candidates by: obtaining, with the processor, input information; and generating, with the processor, one or more second formula candidates based on input information by using the stacked attention module with a tree beam search algorithm. | en_US |
| dc.digitization.specifications | This patent information was downloaded from the US Patent and Trademark website (http://www.uspto.gov/) as image-PDFs. The PDFs were OCRed for access purposes. | en_US |
| dc.format.extent | 20 | en_US |
| dc.identifier.patentID | US12147407B2 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/118066 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | Method for mathematical language processing via tree embeddings | en_US |
| dc.type | Utility patent | en_US |
| dc.type.dcmi | Text | en_US |
| dc.type.genre | patents | en_US |