Abstract
These days, there are more than a million recipes on the Web. When you search for a recipe with one query such as “nikujaga,” the name of a typical Japanese food, you can find thousands of “nikujaga” recipes as the result. Even if you focus on only the top ten results, it is still difficult to find out the characteristic feature of each recipe because a cooking is a work-flow including parallel procedures. According to our survey, people place the most importance on the differences of cooking procedures when they compare the recipes. However, such differences are difficult to be extracted just by comparing the recipe texts as existing methods. Therefore, our system extracts (i) a general way to cook as a summary of cooking procedures and (ii) the characteristic features of each recipe by analyzing the work-flows of the top ten results. In the experiments, our method succeeded in extracting 54% of manually extracted features while the previous research addressed 37% of them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. on Algorithms 6, Article No. 2 (2009)
Do, H.-H., Rahm, E.: COMA – a system for flexible combination of schema matching approaches. In: Proc. of the 28th International Conference on Very Large Data Bases, pp. 610–621 (2002)
Hamada, R., Ide, I., Sakai, S., Tanaka, H.: Structural analysis of cooking preparation steps. IEICE Trans. J85-D-II, 79–89 (2002) (in Japanese)
Karikome, S., Fujii, A.: Improving structural analysis of cooking recipe text. IEICE Technical Report 112(75), DE2012-8, 43–48 (2012) (in Japanese)
Mori, S., Sasada, T., Yamakata, Y., Yoshino, K.: A machine learning approach to recipe text processing. In: Cooking with Computers Workshop, pp. 1–6 (2012)
Phillips, C., Warnow, T.J.: The asymmetric median tree – a new model for building consensus trees. Discrete Applied Mathematics 71, 311–335 (1996)
Sang, E.F.T.K., Meulder, F.D.: Introduction to the CoNLL-2003 shared task: language-independent named entity recognition. In: Proc. of CoNLL 2003, pp. 142–147 (2003)
Shasha, D., Wang, J.T.-L., Zhang, K., Shih, F.Y.: Exact and approximate algorithms for unordered tree matching. IEEE Trans. on Systems, Man, and Cybernetics 24, 668–678 (1994)
Tai, K.-C.: The tree-to-tree correction problem. Journal of the ACM 26, 422–433 (1979)
Tsukuda, K., Nakamura, S., Yamamoto, T., Tanaka, K.: Recommendation of addition and deletion ingredients based on the recipe structure and its stability for exploration of recipes. IEICE Trans. J94-A, 476–487 (2011) (in Japanese)
Yamakata, Y., Kakusho, K., Minoh, M.: A method of recipe to cooking video mapping for automated cooking content construction. IEICE Trans. Inf. & Syst. J90-D, 2817–2829 (2007) (in Japanese)
Yoshino, K., Mori, S., Kawahara, T.: Predicate argument structure analysis using partially annotated corpora. In: Proc. of the Sixth International Joint Conference on Natural Language Processing (to appear)
Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Information Processing Letters 49, 249–254 (1994)
COOKPAD (May 29, 2013), http://cookpad.com/ (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Yamakata, Y., Imahori, S., Sugiyama, Y., Mori, S., Tanaka, K. (2013). Feature Extraction and Summarization of Recipes Using Flow Graph. In: Jatowt, A., et al. Social Informatics. SocInfo 2013. Lecture Notes in Computer Science, vol 8238. Springer, Cham. https://doi.org/10.1007/978-3-319-03260-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-03260-3_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03259-7
Online ISBN: 978-3-319-03260-3
eBook Packages: Computer ScienceComputer Science (R0)