@inproceedings{horspool-aycock-2000-analysis,
title = "Analysis of Equation Structure using Least Cost Parsing",
author = "Horspool, R. Nigel and
Aycock, John",
booktitle = "Proceedings of the Sixth International Workshop on Parsing Technologies",
month = feb # " 23-25",
year = "2000",
address = "Trento, Italy",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2000.iwpt-1.36",
pages = "307--308",
abstract = "Mathematical equations in LaTeX are composed with tags that express formatting as opposed to structure. For conversion from LaTeX to other word-processing systems, the structure of each equation must be inferred. We show how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation. MathML provides another application for the same technology; it has two alternative tagging schemes - presentation tags to specify formatting and content tags to specify structure. While conversion from content tagging to presentation tagging is straightforward, the converse is not. Our implementation of least cost parsing is based on Earley{'}s algorithm.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="horspool-aycock-2000-analysis">
<titleInfo>
<title>Analysis of Equation Structure using Least Cost Parsing</title>
</titleInfo>
<name type="personal">
<namePart type="given">R</namePart>
<namePart type="given">Nigel</namePart>
<namePart type="family">Horspool</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">John</namePart>
<namePart type="family">Aycock</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2000-feb" 23-25"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Trento, Italy</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>Mathematical equations in LaTeX are composed with tags that express formatting as opposed to structure. For conversion from LaTeX to other word-processing systems, the structure of each equation must be inferred. We show how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation. MathML provides another application for the same technology; it has two alternative tagging schemes - presentation tags to specify formatting and content tags to specify structure. While conversion from content tagging to presentation tagging is straightforward, the converse is not. Our implementation of least cost parsing is based on Earley’s algorithm.</abstract>
<identifier type="citekey">horspool-aycock-2000-analysis</identifier>
<location>
<url>https://aclanthology.org/2000.iwpt-1.36</url>
</location>
<part>
<date>2000-feb" 23-25"</date>
<extent unit="page">
<start>307</start>
<end>308</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Analysis of Equation Structure using Least Cost Parsing
%A Horspool, R. Nigel
%A Aycock, John
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F horspool-aycock-2000-analysis
%X Mathematical equations in LaTeX are composed with tags that express formatting as opposed to structure. For conversion from LaTeX to other word-processing systems, the structure of each equation must be inferred. We show how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation. MathML provides another application for the same technology; it has two alternative tagging schemes - presentation tags to specify formatting and content tags to specify structure. While conversion from content tagging to presentation tagging is straightforward, the converse is not. Our implementation of least cost parsing is based on Earley’s algorithm.
%U https://aclanthology.org/2000.iwpt-1.36
%P 307-308
Markdown (Informal)
[Analysis of Equation Structure using Least Cost Parsing](https://aclanthology.org/2000.iwpt-1.36) (Horspool & Aycock, IWPT 2000)
ACL