default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Barthélemy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c18]François Barthélemy:
KNG: a Tool for Writing Easily Transducer Cascades (KNG: un outil pour l'écriture facile de cascades de transducteurs) [in French]. TALN (2) 2014: 485-490- 2011
- [c17]François Barthélemy, Serge Rosmorduc:
Intersection of Multitape Transducers vs. Cascade of Binary Transducers: The Example of {E}gyptian Hieroglyphs Transliteration. FSMNLP 2011: 74-82
2000 – 2009
- 2009
- [j2]François Barthélemy:
A Tree-Structured morphological description of the Akkadian verb which uses Feature Structures and Multi-tape Transducers. Trait. Autom. des Langues 50(2): 173-199 (2009) - [c16]François Barthélemy:
The Karamel System and Semitic Languages: Structured Multi-Tiered Morphology. SEMITIC@EACL 2009: 10-18 - [c15]François Barthélemy:
A Testing Framework for Finite-State Morphology. CIAA 2009: 75-83 - 2008
- [c14]François Barthélemy:
Typage, produit cartésien et unités d'analyse pour les modèles à états finis. TALN (Articles courts) 2008: 71-80 - 2007
- [c13]François Barthélemy:
Using Mazurkiewicz Trace Languages for Partition-Based Morphology. ACL 2007 - [c12]François Barthélemy:
Structures de traits typées et morphologie à partitions. TALN (Articles longs) 2007: 65-74 - [c11]François Barthélemy:
Multi-grain Relations. CIAA 2007: 243-252 - 2006
- [c10]François Barthélemy:
Un analyseur morphologique multi-niveaux utilisant la jointure. TALN (Articles longs) 2006: 63-72 - 2005
- [c9]François Barthélemy:
Partitioning Multitape Transducers. FSMNLP 2005: 11-20 - 2001
- [c8]François Barthélemy, Pierre Boullier, Philippe Deschamp, Éric Villemonte de la Clergerie
:
Guided Parsing of Range Concatenation Languages. ACL 2001: 42-49 - [c7]François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, Éric Villemonte de la Clergerie:
Atelier ATOLL pour les grammaires d'arbres adjoints. TALN (Articles longs) 2001: 63-72
1990 – 1999
- 1998
- [j1]Éric Villemonte de la Clergerie, François Barthélemy:
Information Flow in Tabular Interpretations for Generalized Push-Down Automata. Theor. Comput. Sci. 199(1-2): 167-198 (1998) - [c6]François Barthélemy:
A Morphological Analyzer for Akkadian Verbal Forms with a Model of Phonetic Transformations. SEMITIC@COLING 1998 - 1994
- [c5]François Barthélemy, François Rouaix:
A Modular Architecture For Constraint-Based Parsing. COLING 1994: 454-460 - [c4]François Barthélemy:
A Grammatical Approach to DCG Parsing. ICLP 1994: 632-646 - [c3]François Barthélemy:
Operational Semantics for DCGs. JFPLC 1994: 47-60 - 1992
- [c2]François Barthélemy, Éric Villemonte de la Clergerie:
Subsumption-oriented Push-Down Automata. PLILP 1992: 100-114 - 1991
- [c1]François Barthélemy:
Prédire à bon escient. JTASPEFT/WSA 1991: 139-143
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
