Methods › Graphs › Graph Models › UNS
Unsupervised Abstractive Meeting Summarization
UNS
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
The archive carries no description for this method.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 6 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 6 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 6 of 6, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Wer ist schuld, wenn Algorithmen irren? Entscheidungsautomatisierung, Organisationen und Verantwortung 21 Jul 2022 · 0 repositories · arXiv:2207.10479
-
Evaluation of Automatic Text Simplification: Where are we now, where should we go from here 1 Jun 2022 · 0 repositories
-
Tâches auxiliaires pour l’analyse biaffine en graphes de dépendances (Auxiliary tasks to boost Biaffine Semantic Dependency Parsing) 1 Jun 2022 · 0 repositories
-
Dis-moi comment tu varies ton débit, je te dirai qui tu es (Tell me how you vary your speech flow, I'll tell you who you are Studying inter-speaker variability makes it possible to identify discriminating or even identifying phonetic characteristics) 1 Jun 2020 · 0 repositories
-
Représentation sémantique des familles dérivationnelles au moyen de frames morphosémantiques (Semantic representation of derivational families by means of morphosemantic frames ) 1 Jun 2020 · 0 repositories
-
Unsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization 14 May 2018 · 4 repositories · arXiv:1805.05271
Tasks archive 2025-07-28
13 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections