• Login
    View Item 
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    EaT-PIM: Substituting Entities in Procedural Instructions Using Flow Graphs and Embeddings

    Author
    Shirai, Sola; Kim, HyeongSik
    Thumbnail
    View/Open
    Main article (713.9Kb)
    Supplemental Material (517.5Kb)
    Other Contributors
    Date Issued
    2022-10-16
    Subject
    Semantic Web; Ingredient Substitution; Graph Embedding; Flow Graph; Procedural Instructions; Natural Language Processing
    Degree
    Terms of Use
    Full Citation
    Shirai, S.S., Kim, H. (2022). EaT-PIM: Substituting Entities in Procedural Instructions Using Flow Graphs and Embeddings. In: , et al. The Semantic Web – ISWC 2022. ISWC 2022. Lecture Notes in Computer Science, vol 13489. Springer, Cham. https://doi.org/10.1007/978-3-031-19433-7_10
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/6364
    Abstract
    When cooking, it can sometimes be desirable to substitute ingredients for purposes such as avoiding allergens, replacing a missing ingredient, or exploring new flavors. More generally, the problem of substituting entities used in procedural instructions is challenging as it requires an understanding of how entities and actions in the instructions interact to produce the final result. To support the task of automatically identifying viable substitutions, we introduce a methodology to (1) parse instructions, using NLP tools and domain-specific ontologies, to generate flow graph representations, (2) train a novel embedding model which captures flow and interaction of entities in each step of the instructions, and (3) utilize the embeddings to identify plausible substitutions. Our embedding strategy aggregates nodes and dynamically computes intermediate results within the flow graphs, which requires learning embeddings for fewer nodes than typical graph embedding models. Our rule-based flow graph generation method shows comparable performance to machine learning-based work, while our embedding model outperforms baselines on a link-prediction task for ingredients in recipes.;
    Department
    Publisher
    Springer, Cham
    Relationships
    Access
    Collections
    • Tetherless World Publications

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2023  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV