@inproceedings{Bogel2012Roman-30064,
  year={2012},
  title={Urdu - Roman Transliteration via Finite State Transducers},
  url={http://aclweb.org/anthology/W12-6204},
  isbn={978-1-62748-362-9},
  publisher={Association für Computational Linguistics (ACL)},
  address={Stroudsburg, PA},
  booktitle={FSMNLP 2012 : Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing ; July 23-25, 2012, University of the Basque Country, Donostia-San Sebastián},
  pages={25--29},
  author={Bögel, Tina}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/30064">
    <dcterms:abstract xml:lang="eng">This paper introduces a two-way Urdu–Roman transliterator based solely on a nonprobabilistic finite state transducer that solves the encountered scriptural issues via a particular architectural design in combination with a set of restrictions. In order to deal with the enormous amount of overgenerations caused by inherent properties of the Urdu script, the transliterator depends on a set of phonological and orthographic restrictions and a word list; additionally, a default component is implemented to allow for unknown entities to be transliterated, thus ensuring a large degree of flexibility in addition to robustness.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-25T14:40:11Z</dcterms:available>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30064"/>
    <dc:creator>Bögel, Tina</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-25T14:40:11Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Bögel, Tina</dc:contributor>
    <dcterms:issued>2012</dcterms:issued>
    <dc:language>eng</dc:language>
    <dcterms:title>Urdu - Roman Transliteration via Finite State Transducers</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30064/3/Boegel_0-277808.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30064/3/Boegel_0-277808.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
  </rdf:Description>
</rdf:RDF>