Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Pierre-François Jurie

dblp:50/4992 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › parsing
chart parsing		 0.011989
Efficient Parsing for French · ACL 1989
Automata and formal languages
parsing		 0.011989
Efficient Parsing for French · ACL 1989

Methods — techniques the papers use, named apart from their topics

unification-based grammar · 0.0heuristic spurious parse elimination · 0.0
YearPublicationVenuePosition
1989 Efficient Parsing for French
abstract
Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French developed on an unification based categorial grammar (FG) which avoids these problems. This parser is a bottom-up chart parser augmented with a heuristic eliminating spurious parses. The unicity and completeness of parsing are proved.
Claire Gardent, Gabriel G. Bès, Pierre-François Jurie, Karine Baschung
 ACL3