Umeå universitets logga

umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. (Foundations of Language Processing)ORCID-id: 0000-0001-7349-7693
Technische Universität Dresden, Dresden, Germany.
Technische Universität Dresden, Dresden, Germany.
2022 (Engelska)Ingår i: Implementation and Application of Automata (CIAA 2022): 26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings / [ed] Caron P.; Mignot L., Springer Science+Business Media B.V., 2022, s. 93-105Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

We introduce an automaton model for recognizing sets of hybrid trees, the hybrid tree automaton (HTA).    Special cases of hybrid trees are constituent trees and dependency trees, as they occur in natural language processing.    This includes the cases of discontinuous  constituent trees and non-projective dependency trees.   In general, a hybrid tree is a tree over a ranked alphabet %of symbols and indexed symbols, an indexed symbol being a symbol paired with   in which symbols can additionally be equipped with an index,   i.e.,   a natural number which indicates the position of that symbol in the yield of the hybrid tree.    As a special case of HTA, we define constituent tree automata (CTA) which recognize sets of  constituent trees. We show that the set of yields of a CTA-recognizable set of constituent trees is an LCFRS language, and vice versa.

Ort, förlag, år, upplaga, sidor
Springer Science+Business Media B.V., 2022. s. 93-105
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 13266
Nyckelord [en]
tree language, constituent tree, dependency tree, hybrid tree
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
datalogi
Identifikatorer
URN: urn:nbn:se:umu:diva-194090DOI: 10.1007/978-3-031-07469-1_7ISI: 000876366600007Scopus ID: 2-s2.0-85131956678ISBN: 978-3-031-07468-4 (tryckt)ISBN: 978-3-031-07469-1 (digital)OAI: oai:DiVA.org:umu-194090DiVA, id: diva2:1653727
Konferens
CIAA 2022: 26th International Conference on Implementation and Application of Automata, Rouen, France, June 28 - July 1, 2022
Tillgänglig från: 2022-04-24 Skapad: 2022-04-24 Senast uppdaterad: 2022-12-30Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Drewes, Frank

Sök vidare i DiVA

Av författaren/redaktören
Drewes, Frank
Av organisationen
Institutionen för datavetenskap
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 153 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf