Languages generated by two-level morphological rules:
Abstract: "The two-level model of morphology and phonology arose from work on finite state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite indep...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
496 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The two-level model of morphology and phonology arose from work on finite state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite independently of any computational representation as sets of finite state transducers. Thus defined, the two-level model can be shown to be less powerful, in terms of weak generative capacity, than parallel intersections of of [sic] arbitrary finite state transducers without empty transitions (the usual computational representation) However, if a special boundary symbol is permitted, the full family of regular languages can be generated. Two-level morphological grammars may, without loss of generality, be written in a simplified normal form. The set of two-level generated languages can be shown not to be closed under complementation and union. |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452591 | ||
| 003 | DE-604 | ||
| 005 | 20200608 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24437299 | ||
| 035 | |a (DE-599)BVBBV010452591 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ritchie, Graeme D. |d 1949- |e Verfasser |0 (DE-588)1053267800 |4 aut | |
| 245 | 1 | 0 | |a Languages generated by two-level morphological rules |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 496 | |
| 520 | 3 | |a Abstract: "The two-level model of morphology and phonology arose from work on finite state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite independently of any computational representation as sets of finite state transducers. Thus defined, the two-level model can be shown to be less powerful, in terms of weak generative capacity, than parallel intersections of of [sic] arbitrary finite state transducers without empty transitions (the usual computational representation) | |
| 520 | 3 | |a However, if a special boundary symbol is permitted, the full family of regular languages can be generated. Two-level morphological grammars may, without loss of generality, be written in a simplified normal form. The set of two-level generated languages can be shown not to be closed under complementation and union. | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Linguistics |2 sigle | |
| 650 | 4 | |a Grammatik | |
| 650 | 4 | |a Linguistik | |
| 650 | 4 | |a Computational linguistics | |
| 650 | 4 | |a Grammar, Comparative and general |x Morphology | |
| 650 | 4 | |a Grammar, Comparative and general |x Phonology | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 496 |w (DE-604)BV010450646 |9 496 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006965475 | ||
Datensatz im Suchindex
| _version_ | 1804124885836890112 |
|---|---|
| any_adam_object | |
| author | Ritchie, Graeme D. 1949- |
| author_GND | (DE-588)1053267800 |
| author_facet | Ritchie, Graeme D. 1949- |
| author_role | aut |
| author_sort | Ritchie, Graeme D. 1949- |
| author_variant | g d r gd gdr |
| building | Verbundindex |
| bvnumber | BV010452591 |
| ctrlnum | (OCoLC)24437299 (DE-599)BVBBV010452591 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02218nam a2200385 cb4500</leader><controlfield tag="001">BV010452591</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200608 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24437299</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452591</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ritchie, Graeme D.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1053267800</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Languages generated by two-level morphological rules</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">496</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The two-level model of morphology and phonology arose from work on finite state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite independently of any computational representation as sets of finite state transducers. Thus defined, the two-level model can be shown to be less powerful, in terms of weak generative capacity, than parallel intersections of of [sic] arbitrary finite state transducers without empty transitions (the usual computational representation)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">However, if a special boundary symbol is permitted, the full family of regular languages can be generated. Two-level morphological grammars may, without loss of generality, be written in a simplified normal form. The set of two-level generated languages can be shown not to be closed under complementation and union.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grammatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linguistik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational linguistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grammar, Comparative and general</subfield><subfield code="x">Morphology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grammar, Comparative and general</subfield><subfield code="x">Phonology</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">496</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">496</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965475</subfield></datafield></record></collection> |
| id | DE-604.BV010452591 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965475 |
| oclc_num | 24437299 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Ritchie, Graeme D. 1949- Verfasser (DE-588)1053267800 aut Languages generated by two-level morphological rules Edinburgh 1990 25 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 496 Abstract: "The two-level model of morphology and phonology arose from work on finite state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite independently of any computational representation as sets of finite state transducers. Thus defined, the two-level model can be shown to be less powerful, in terms of weak generative capacity, than parallel intersections of of [sic] arbitrary finite state transducers without empty transitions (the usual computational representation) However, if a special boundary symbol is permitted, the full family of regular languages can be generated. Two-level morphological grammars may, without loss of generality, be written in a simplified normal form. The set of two-level generated languages can be shown not to be closed under complementation and union. Bionics and artificial intelligence sigle Computer software sigle Linguistics sigle Grammatik Linguistik Computational linguistics Grammar, Comparative and general Morphology Grammar, Comparative and general Phonology Department of Artificial Intelligence: DAI research paper University <Edinburgh> 496 (DE-604)BV010450646 496 |
| spellingShingle | Ritchie, Graeme D. 1949- Languages generated by two-level morphological rules Bionics and artificial intelligence sigle Computer software sigle Linguistics sigle Grammatik Linguistik Computational linguistics Grammar, Comparative and general Morphology Grammar, Comparative and general Phonology |
| title | Languages generated by two-level morphological rules |
| title_auth | Languages generated by two-level morphological rules |
| title_exact_search | Languages generated by two-level morphological rules |
| title_full | Languages generated by two-level morphological rules |
| title_fullStr | Languages generated by two-level morphological rules |
| title_full_unstemmed | Languages generated by two-level morphological rules |
| title_short | Languages generated by two-level morphological rules |
| title_sort | languages generated by two level morphological rules |
| topic | Bionics and artificial intelligence sigle Computer software sigle Linguistics sigle Grammatik Linguistik Computational linguistics Grammar, Comparative and general Morphology Grammar, Comparative and general Phonology |
| topic_facet | Bionics and artificial intelligence Computer software Linguistics Grammatik Linguistik Computational linguistics Grammar, Comparative and general Morphology Grammar, Comparative and general Phonology |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT ritchiegraemed languagesgeneratedbytwolevelmorphologicalrules |