Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add link to Goodman, 2019 #147

Merged
merged 4 commits into from
Sep 11, 2024
Merged

Add link to Goodman, 2019 #147

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
dd9390c
Add link to Goodman, 2019
bact Aug 7, 2024
d5351d1
Update README.md
bact Sep 10, 2024
553b5b8
Add url and abstract
bact Sep 10, 2024
6e9ad0a
Fix Bibtex comma
bact Sep 10, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 8 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,8 +138,10 @@ The BibTeX is below:
}
```

For the graph transformation/normalization work, please use the
following:
For the graph transformation/normalization work, please cite [Goodman, 2019].
The BibTeX is below:

[Goodman, 2019]: https://jaslli.org/files/proceedings/05_paclic33_postconf.pdf

``` bibtex
@inproceedings{Goodman:2019,
Expand All @@ -148,7 +150,10 @@ following:
booktitle = "Proceedings of the 33rd Pacific Asia Conference on Language, Information, and Computation",
year = "2019",
pages = "47--56",
address = "Hakodate"
address = "Hakodate",
publisher = "Japanese Association for the Study of Logic, Language and Information",
url = "https://jaslli.org/files/proceedings/05_paclic33_postconf.pdf",
abstract = "Abstract Meaning Representation (AMR; Banarescu et al., 2013) encodes the meaning of sentences as a directed graph and Smatch (Cai and Knight, 2013) is the primary metric for evaluating AMR graphs. Smatch, however, is unaware of some meaning-equivalent variations in graph structure allowed by the AMR Specification and gives different scores for AMRs exhibiting these variations. In this paper I propose four normalization methods for helping to ensure that conceptually equivalent AMRs are evaluated as equivalent. Equivalent AMRs with and without normalization can look quite different—comparing a gold corpus to itself with relation reification alone yields a difference of 25 Smatch points, suggesting that the outputs of two systems may not be directly comparable without normalization. The algorithms described in this paper are implemented on top of an existing open-source Python toolkit for AMR and will be released under the same license."
}
```

Expand Down
Loading