Representing Constraints with Automata
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the assignments which make the formulas true. We show that this...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Morawietz, Frank Cornell, Tom |
| description | In this paper we describe an approach to constraint-based syntactic theories
in terms of finite tree automata. The solutions to constraints expressed in
weak monadic second order (MSO) logic are represented by tree automata
recognizing the assignments which make the formulas true. We show that this
allows an efficient representation of knowledge about the content of
constraints which can be used as a practical tool for grammatical theory
verification. We achieve this by using the intertranslatability of formulas of
MSO logic and tree automata and the embedding of MSO logic into a constraint
logic programming scheme. The usefulness of the approach is discussed with
examples from the realm of Principles-and-Parameters based parsing. |
| doi_str_mv | 10.48550/arxiv.cmp-lg/9704006 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_cmp_lg_9704006</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cmp_lg_9704006</sourcerecordid><originalsourceid>FETCH-LOGICAL-a756-def221588f2fb29eed45703fbdb08b064c3f0260f6e61096338984a58b7287143</originalsourceid><addsrcrecordid>eNotzrsKwjAYQOEsDqI-glAQ3Kp_c-8oxRsIgnQviU1qoK0ljbe3V9TpbIcPoWkCCyoZg6XyT3dfnJsurqtlKoAC8CGan0znTW_a4Noqyq5tH7xybeijhwuXaHUL10YFNUYDq-reTP4doXyzzrNdfDhu99nqECvBeFwai3HCpLTYapwaU1ImgFhdapAaOD0TC5iD5YYnkHJCZCqpYlILLEVCyQjNftsvtui8a5R_FR90UVfFH03e_t890w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Representing Constraints with Automata</title><source>arXiv.org</source><creator>Morawietz, Frank ; Cornell, Tom</creator><creatorcontrib>Morawietz, Frank ; Cornell, Tom</creatorcontrib><description>In this paper we describe an approach to constraint-based syntactic theories
in terms of finite tree automata. The solutions to constraints expressed in
weak monadic second order (MSO) logic are represented by tree automata
recognizing the assignments which make the formulas true. We show that this
allows an efficient representation of knowledge about the content of
constraints which can be used as a practical tool for grammatical theory
verification. We achieve this by using the intertranslatability of formulas of
MSO logic and tree automata and the embedding of MSO logic into a constraint
logic programming scheme. The usefulness of the approach is discussed with
examples from the realm of Principles-and-Parameters based parsing.</description><identifier>DOI: 10.48550/arxiv.cmp-lg/9704006</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>1997-04</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/cmp-lg/9704006$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.cmp-lg/9704006$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Morawietz, Frank</creatorcontrib><creatorcontrib>Cornell, Tom</creatorcontrib><title>Representing Constraints with Automata</title><description>In this paper we describe an approach to constraint-based syntactic theories
in terms of finite tree automata. The solutions to constraints expressed in
weak monadic second order (MSO) logic are represented by tree automata
recognizing the assignments which make the formulas true. We show that this
allows an efficient representation of knowledge about the content of
constraints which can be used as a practical tool for grammatical theory
verification. We achieve this by using the intertranslatability of formulas of
MSO logic and tree automata and the embedding of MSO logic into a constraint
logic programming scheme. The usefulness of the approach is discussed with
examples from the realm of Principles-and-Parameters based parsing.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAYQOEsDqI-glAQ3Kp_c-8oxRsIgnQviU1qoK0ljbe3V9TpbIcPoWkCCyoZg6XyT3dfnJsurqtlKoAC8CGan0znTW_a4Noqyq5tH7xybeijhwuXaHUL10YFNUYDq-reTP4doXyzzrNdfDhu99nqECvBeFwai3HCpLTYapwaU1ImgFhdapAaOD0TC5iD5YYnkHJCZCqpYlILLEVCyQjNftsvtui8a5R_FR90UVfFH03e_t890w</recordid><startdate>19970421</startdate><enddate>19970421</enddate><creator>Morawietz, Frank</creator><creator>Cornell, Tom</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>19970421</creationdate><title>Representing Constraints with Automata</title><author>Morawietz, Frank ; Cornell, Tom</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a756-def221588f2fb29eed45703fbdb08b064c3f0260f6e61096338984a58b7287143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Morawietz, Frank</creatorcontrib><creatorcontrib>Cornell, Tom</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Morawietz, Frank</au><au>Cornell, Tom</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Representing Constraints with Automata</atitle><date>1997-04-21</date><risdate>1997</risdate><abstract>In this paper we describe an approach to constraint-based syntactic theories
in terms of finite tree automata. The solutions to constraints expressed in
weak monadic second order (MSO) logic are represented by tree automata
recognizing the assignments which make the formulas true. We show that this
allows an efficient representation of knowledge about the content of
constraints which can be used as a practical tool for grammatical theory
verification. We achieve this by using the intertranslatability of formulas of
MSO logic and tree automata and the embedding of MSO logic into a constraint
logic programming scheme. The usefulness of the approach is discussed with
examples from the realm of Principles-and-Parameters based parsing.</abstract><doi>10.48550/arxiv.cmp-lg/9704006</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.cmp-lg/9704006 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_cmp_lg_9704006 |
| source | arXiv.org |
| subjects | Computer Science - Computation and Language |
| title | Representing Constraints with Automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T14%3A17%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Representing%20Constraints%20with%20Automata&rft.au=Morawietz,%20Frank&rft.date=1997-04-21&rft_id=info:doi/10.48550/arxiv.cmp-lg/9704006&rft_dat=%3Carxiv_GOX%3Ecmp_lg_9704006%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |